A Normal (0, 1)-Polytope None of Whose Regular Triangulations Is Unimodular

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Point Set Whose Space of Triangulations Is Disconnected

In this paper we explicitly construct a triangulation of a 6-dimensional point configuration of 324 points which admits no geometric bistellar operations (or flips, for short). This triangulation is an isolated element in the graph of triangulations of the point configuration. It has been a central open question in polytope combinatorics in the last decade whether point configurations exist for...

متن کامل

Finding Small Triangulations of Polytope Boundaries Is Hard

We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal triangulation of such a 3-ball. A lifting argument is used to transfer the result also to triangulations of boundaries of 4-polytopes. The proof is constructive and translates a variant of the 3-SAT problem into an instanc...

متن کامل

A Totally Unimodular Description of the Consistent Value Polytope

We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consistent value polytope and give a linear programming description that is provably tighter than a recently studied formulation. We then provide an experimental study that shows that, despite the theoretical progress, in practice filte...

متن کامل

On the 0/1 knapsack polytope

Given a set N of items and a capacity b 2 IN, and let N j be the set of items with weight j, 1 j b. The 0/1 knapsack polytope is the convex hull of all 0/1 vectors that satisfy the inequality b X j=1 X i2N j jx i b: In this paper we rst present a complete linear description of the 0/1 knapsack polytope for two special cases: (a) N j = ; for all 1 < j b b 2 c and (b) N j = ; for all 1 < j b b 3 ...

متن کامل

0 M ay 2 00 9 A functional equation whose unknown is P ( [ 0 , 1 ] ) valued

We study a functional equation whose unknown maps a euclidean space into the space of probability distributions on [0, 1]. We prove existence and uniqueness of its solution under suitable regularity and boundary conditions and we characterize solutions that are diffuse on [0, 1]. A canonical solution is obtained by means of a Randomly Reinforced Urn with different reinforcement distributions ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 1999

ISSN: 0179-5376

DOI: 10.1007/pl00009415